Similarity-Based Inconsistency-Tolerant Logics
نویسندگان
چکیده
Many logics for AI applications that are defined by denotational semantics are trivialized in the presence of inconsistency. It is therefore often desirable, and practically useful, to refine such logics in a way that inconsistency does not cause the derivation of any formula, and, at the same time, inferences with respect to consistent premises are not affected. In this paper, we introduce a general method of doing so by incorporating preference relations defined in terms of similarities. We exemplify our method for three of the most common denotational semantics (standard many-valued matrices, their non-deterministic generalization, and possible worlds semantics), and demonstrate their usefulness for reasoning with inconsistency.
منابع مشابه
Paraconsistency Everywhere
Paraconsistent logics are, by definition, inconsistency tolerant: In a paraconsistent logic, inconsistencies need not entail everything. However, there is more than one way a body of information can be inconsistent. In this paper I distinguish contradictions from other inconsistencies, and I show that many different logics are in an important sense, “paraconsistent” in virtue of being inconsist...
متن کاملInconsistency-Tolerance in Knowledge-Based Systems by Dissimilarities
Distance-based reasoning is a well-known approach for defining non-monotonic and paraconsistent formalisms, which so far has been mainly used in the context of standard two-valued semantics. In this paper, we extend this approach to arbitrary denotational semantics by considering dissimilarities, a generalization of distances. Dissimilarity-based reasoning is then applied for handling inconsist...
متن کاملInconsistency-Tolerant Semantics for Description Logics
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Our general goal is both to study DL semantical frameworks which are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries posed to DL knowledge bases under such inconsistency-tolerant semantics. Our work is inspired by the approaches to consistent query answe...
متن کاملComplexity of Inconsistency-Tolerant Query Answering in Datalog+/-
The study of inconsistency-tolerant semantics for query answering in ontological languages has recently gained much attention. In this work, we consider three inconsistency-tolerant semantics recently proposed in the literature, namely: consistent query answering, the intersection (also called IAR) semantics, and the intersection of closed repairs (ICR) semantics. We study the data complexity o...
متن کامل